/*=====================================================================*
 *                   Copyright (C) 2011 Paul Mineiro                   *
 * All rights reserved.                                                *
 *                                                                     *
 * Redistribution and use in source and binary forms, with             *
 * or without modification, are permitted provided that the            *
 * following conditions are met:                                       *
 *                                                                     *
 *     * Redistributions of source code must retain the                *
 *     above copyright notice, this list of conditions and             *
 *     the following disclaimer.                                       *
 *                                                                     *
 *     * Redistributions in binary form must reproduce the             *
 *     above copyright notice, this list of conditions and             *
 *     the following disclaimer in the documentation and/or            *
 *     other materials provided with the distribution.                 *
 *                                                                     *
 *     * Neither the name of Paul Mineiro nor the names                *
 *     of other contributors may be used to endorse or promote         *
 *     products derived from this software without specific            *
 *     prior written permission.                                       *
 *                                                                     *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND              *
 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,         *
 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES               *
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE             *
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER               *
 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,                 *
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES            *
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE           *
 * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR                *
 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF          *
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT           *
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY              *
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE             *
 * POSSIBILITY OF SUCH DAMAGE.                                         *
 *                                                                     *
 * Contact: Paul Mineiro <paul@mineiro.com>                            *
 *=====================================================================*/

#ifndef __FEATURE_HH__
#define __FEATURE_HH__

#include <stdint.h>
#include <vector>

namespace playerpiano
{
  struct Feature
    {
      uint64_t feature;
      float    value;
    };

  typedef std::vector<Feature> FeatureSet;
  
  class IndexedFeatureSet : public std::vector<FeatureSet>
    {
      private:
      public:
        IndexedFeatureSet () : std::vector<FeatureSet> (256)
          {
          }

        void
        reset ()
          {
            for (unsigned int i = 0; i < size (); ++i)
              {
                this->operator[] (i).resize (0);
              }
          }

        size_t
        total_size ()
          {
            size_t rv = 0;

            for (unsigned int i = 0; i < size (); ++i)
              {
                rv += this->operator[] (i).size ();
              }

            return rv;
          }
    };

  class IndexedFeatureSetIterator
    {
      private:
        typedef std::vector<Feature>::const_iterator sub_iterator;

        const IndexedFeatureSet& feature_set;
        unsigned int             ns;
        sub_iterator             sub_it;

        void
        next_valid ()
          {
            while (sub_it == feature_set[ns].end () && ns < 255)
              {
                ++ns;
                sub_it = feature_set[ns].begin ();
              }
          }

      public:
        IndexedFeatureSetIterator (const IndexedFeatureSet& _feature_set,
                                   unsigned int             _ns)
          : feature_set (_feature_set),
            ns (_ns > 255 ? 255 : _ns),
            sub_it (_ns > 255 ? feature_set[255].end () 
                              : feature_set[_ns].begin ())
          {
            next_valid ();
          }

        IndexedFeatureSetIterator&
        operator++ ()
          {
            ++sub_it;
            next_valid ();

            return *this;
          }

        const Feature&
        operator* ()
          {
            return *sub_it;
          }

        bool
        operator!= (const IndexedFeatureSetIterator& o)
          {
            return ns != o.ns ||
                   sub_it != o.sub_it;
          }
    };

  IndexedFeatureSetIterator
  begin (const IndexedFeatureSet& s)
    {
      return IndexedFeatureSetIterator (s, 0);
    }

  IndexedFeatureSetIterator
  end (const IndexedFeatureSet& s)
    {
      return IndexedFeatureSetIterator (s, 256);
    }
}

#endif // __FEATURE_HH__
